Probabilistic assignment: an extension approach
نویسندگان
چکیده
منابع مشابه
Probabilistic Assignment: An Extension Approach∗
We study the problem of allocating objects using lotteries when agents only submit preferences over objects. A standard approach is to “extend” agents’ preferences over objects to preferences over lotteries, using (first-order) stochastic dominance, or the sd-extension. Following Cho (2016), we complement this approach with two alternative extensions, the dland ulextensions, that give rise to l...
متن کاملProbabilistic Assignment: A Two-fold Axiomatic Approach
We study the problem of allocating objects by means of probabilistic mechanisms. Each agent has strict preferences over objects and ex post receives exactly one object. A standard approach in the literature is to extend agents' preferences over objects to preferences over lotteries de ned on those objects, using the rst-order stochastic dominance criterion, or the sd-extension. In a departure f...
متن کاملDEA with Missing Data: An Interval Data Assignment Approach
In the classical data envelopment analysis (DEA) models, inputs and outputs are assumed as known variables, and these models cannot deal with unknown amounts of variables directly. In recent years, there are few researches on handling missing data. This paper suggests a new interval based approach to apply missing data, which is the modified version of Kousmanen (2009) approach. First, the prop...
متن کاملAn Approach to Increasing Reliability Using Syndrome Extension
Computational errors in numerical data processing may be detected efficiently by using parity values associated with real number codes, even when inherent round off errors are allowed in addition to failure disruptions. This paper examines correcting turbo codes by straightforward application of an algorithm derived for finite-field codes, modified to operate over any field. There are syndromes...
متن کاملImpossibilities for probabilistic assignment
We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Choice and Welfare
سال: 2018
ISSN: 0176-1714,1432-217X
DOI: 10.1007/s00355-018-1110-z